Value Iteration Networks With Gated Summarization Module

نویسندگان

چکیده

In this paper, we address the challenges faced by Value Iteration Networks (VIN) in handling larger input maps and mitigating impact of accumulated errors caused increased iterations. We propose a novel approach, with Gated Summarization Module (GS-VIN), which incorporates two main improvements: 1) employing an Adaptive Strategy module to reduce number iterations; 2) introducing summarize iterative process. The adaptive iteration strategy uses convolution kernels fewer times, reducing network depth increasing training stability while maintaining accuracy planning gated summarization enables emphasize entire process, rather than solely relying on final global outcome, temporally spatially resampling process within VI module. conduct experiments 2D grid world path-finding problems Atari Mr. Pac-man environment, demonstrating that GS-VIN outperforms baseline terms single-step accuracy, success rate, overall performance across different map sizes. Additionally, provide analysis relationship between size, kernel iterations VI-based models, is applicable majority models offers valuable insights for researchers industrial deployment.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Value Iteration Networks

We introduce the value iteration network (VIN): a fully differentiable neural network with a ‘planning module’ embedded within. VINs can learn to plan, and are suitable for predicting outcomes that involve planning-based reasoning, such as policies for reinforcement learning. Key to our approach is a novel differentiable approximation of the value-iteration algorithm, which can be represented a...

متن کامل

Generalized Value Iteration Networks: Life Beyond Lattices

In this paper, we introduce a generalized value iteration network (GVIN), which is an end-to-end neural network planning module. GVIN emulates the value iteration algorithm by using a novel graph convolution operator, which enables GVIN to learn and plan on irregular spatial graphs. We propose three novel differentiable kernels as graph convolution operators and show that the embedding-based ke...

متن کامل

Soft Value Iteration Networks for Planetary Rover Path Planning

Value iteration networks are an approximation of the value iteration (VI) algorithm implemented with convolutional neural networks to make VI fully differentiable. In this work, we study these networks in the context of robot motion planning, with a focus on applications to planetary rovers. The key challenging task in learningbased motion planning is to learn a transformation from terrain obse...

متن کامل

Value iteration and optimization of multiclass queueing networks

This paper considers in parallel the scheduling problem for multi class queueing networks and optimization of Markov decision processes It is shown that the value iteration algorithm may perform poorly when the algo rithm is not initialized properly The most typical case where the initial value function is taken to be zero may be a particularly bad choice In contrast if the value iteration algo...

متن کامل

Approximate Value Iteration with Temporally Extended Actions

Temporally extended actions have proven useful for reinforcement learning, but their duration also makes them valuable for efficient planning. The options framework provides a concrete way to implement and reason about temporally extended actions. Existing literature has demonstrated the value of planning with options empirically, but there is a lack of theoretical analysis formalizing when pla...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2023

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2023.3286729